Abelian p-groups and the Halting problem
نویسندگان
چکیده
We investigate which effectively presented abelian p-groups are isomorphic relative to the halting problem. The standard approach to this and similar questions uses the notion of ∆2-categoricity (to be defined). We partially reduce the description of ∆ 0 2-categorical p-groups of Ulm type 1 to the analogous problem for equivalence structures. Using this reduction, we solve to a problem left open in [5]. For the sake of the mentioned above reduction, we introduce a new notion of effective ∆2-categoricity that lies strictly in-between plain ∆2-categoricity and relative ∆ 0 2-categoricity (to be defined). We then reduce the problem of classifying effective ∆2-categoricity to a question stated in terms of Σ 0 2-sets. Among other results, we show that for c.e. Turing degrees bounding such sets is equal to being complete.
منابع مشابه
THE STRUCTURE OF FINITE ABELIAN p-GROUPS BY THE ORDER OF THEIR SCHUR MULTIPLIERS
A well-known result of Green [4] shows for any finite p-group G of order p^n, there is an integer t(G) , say corank(G), such that |M(G)|=p^(1/2n(n-1)-t(G)) . Classifying all finite p-groups in terms of their corank, is still an open problem. In this paper we classify all finite abelian p-groups by their coranks.
متن کاملOn the Exponent of Triple Tensor Product of p-Groups
The non-abelian tensor product of groups which has its origins in algebraic K-theory as well as inhomotopy theory, was introduced by Brown and Loday in 1987. Group theoretical aspects of non-abelian tensor products have been studied extensively. In particular, some studies focused on the relationship between the exponent of a group and exponent of its tensor square. On the other hand, com...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملAn explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملFinite $p$-groups and centralizers of non-cyclic abelian subgroups
A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq Z(G)$. In this paper, we give a complete classification of finite $mathcal{CAC}$-$p$-groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 167 شماره
صفحات -
تاریخ انتشار 2016